Undirected Connectivity in O(log
نویسندگان
چکیده
We present a deterministic algorithm for the connectivity problem on undirected graphs that runs in O(log n) space. Thus, the recursive doubling technique of Savich which requires Θ(log n) space is not optimal for this problem.
منابع مشابه
Simple labeling schemes for graph connectivity
Let G = (V,E) be an undirected graph and let S ⊆ V . The S-connectivity SG(u, v) of a pair of nodes u, v in G is the maximum number of uv-paths that no two of them have an edge or a node in S ∖ {u, v} in common. Edge-connectivity is the case S = ∅ and node-connectivity is the case S = V . Given a graph G = (V,E), an integer k, a subset T ⊆ V of terminals, and S ⊆ V , we consider the problem of ...
متن کاملUndirected Connectivity in O(log ^1.5 n) Space
We present a deterministic algorithm for the con-nectivity problem on undirected graphs that runs in O(log 1:5 n) space. Thus, the recursive doubling technique of Savich which requires (log 2 n) space is not optimal for this problem.
متن کاملUndirected ST-Connectivity in Log-Space PRELIMINARY VERSION
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log(·) obtained by Armoni, Ta-Shma, Wigderson and Zhou [ATSWZ00]. As undirected st-connectivity is complete for the class of problems solvable by symmetric, non-deterministic, log-space computations (the class SL), this al...
متن کاملUndirected ST-Connectivity in Log-Space PRELIMINARY VERSION: PLEASE DO NOT DISTRIBUTE
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log(·) obtained by Armoni, Ta-Shma, Wigderson and Zhou [ATSWZ00]. As undirected st-connectivity is complete for the class of problems solvable by symmetric, non-deterministic, log-space computations (the class SL), this al...
متن کاملSimulating Undirected st-Connectivity Algorithms on Uniform JAGs and NNJAGs
In a breakthrough result, Reingold [17] showed that the Undirected st-Connectivity problem can be solved in O(log n) space. The next major challenge in this direction is whether one can extend it to directed graphs, and thereby lowering the deterministic space complexity ofRL or NL. In this paper, we show that Reingold’s algorithm, the O(log n)space algorithm by Armoni et al. [3] and the O(log ...
متن کامل